51 research outputs found
An Achievable Rate-Distortion Region for the Multiple Descriptions Problem
A multiple-descriptions (MD) coding strategy is proposed and an inner bound
to the achievable rate-distortion region is derived. The scheme utilizes linear
codes. It is shown in two different MD set-ups that the linear coding scheme
achieves a larger rate-distortion region than previously known random coding
strategies. Furthermore, it is shown via an example that the best known random
coding scheme for the set-up can be improved by including additional randomly
generated codebooks
A New Achievable Rate Region for Multiple-Access Channel with States
The problem of reliable communication over the multiple-access channel (MAC)
with states is investigated. We propose a new coding scheme for this problem
which uses quasi-group codes (QGC). We derive a new computable single-letter
characterization of the achievable rate region. As an example, we investigate
the problem of doubly-dirty MAC with modulo- addition. It is shown that the
sum-rate bits per channel use is achievable using the new scheme.
Whereas, the natural extension of the Gel'fand-Pinsker scheme, sum-rates
greater than are not achievable.Comment: 13 pages, ISIT 201
- β¦